Normality of tree-growing search strategies

Tutoring Strategies in Game-Tree Search

Introduction. According to the analysis of grandmaster-like strategies in Shogi [Iida and Uiterwijk 1993], it is important for a teacher, at the beginning stages of teaching, to intentionally lose an occasional game against a novice opponent, or to play less than optimally in order to give the novice some prospects of winning, without this being noticed by the opponent. Such a strategy is calle...

Connecting Yule Process, Bisection and Binary Search Tree via Martingales

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

On Performance Deviation of Binary Search Tree Searches from the Optimal Search Tree Search Structures

Binary Search Trees are a frequently used data structure for rapid access to the stored data. Data structures like arrays, vectors and linked lists are limited by the trade-off between the ability to perform a fast search and resize easily. They are an alternative that is both dynamic in size and easily searchable. Due to efficiency reason, complete and nearly complete binary search trees are o...

σ-Normality of Topological Spaces

Strategies of Search

A series of logically related experiments is described with the aim of identifying spe&c features of search strategies in diverse situations. Several distincrive charactkstics, associated with increase in age, (9 to 15 years), emerge. The question of the reJation of physical to mental searches is examined, and the thesis ad% anced that a theory of subjective information, with a network of suppo...